Algorithms for Irrelevance-Based Partial MAPs
نویسنده
چکیده
Irrelevance-based partial MAPs are useful constructs for domain-independent explana tion using belief networks. We look at two definitions for such partial MAPs, and prove important properties that are useful in de signing algorithms for computing them effec tively. We make use of these properties in modifying our standard MAP best-first algo rithm, so as to handle irrelevance-based par tial MAPs.
منابع مشابه
Relevant Explanations: Allowing Disjunctive Assignments
Relevance-based explanation is a scheme in which partial assignments to Bayesian belief network variables are explanations ( abduc tive conclusions). We allow variables to re main unassigned in explanations as long as they are irrelevant to the explanation, where irrelevance is defined in terms of statistical in dependence. When multiple-valued variables exist in the system, especially when ...
متن کاملDetermination of Best Supervised Classification Algorithm for Land Use Maps using Satellite Images (Case Study: Baft, Kerman Province, Iran)
According to the fundamental goal of remote sensing technology, the image classification of desired sensors can be introduced as the most important part of satellite image interpretation. There exist various algorithms in relation to the supervised land use classification that the most pertinent one should be determined. Therefore, this study has been conducted to determine the best and most su...
متن کاملA Family of Selective Partial Update Affine Projection Adaptive Filtering Algorithms
In this paper we present a general formalism for the establishment of the family of selective partial update affine projection algorithms (SPU-APA). The SPU-APA, the SPU regularized APA (SPU-R-APA), the SPU partial rank algorithm (SPU-PRA), the SPU binormalized data reusing least mean squares (SPU-BNDR-LMS), and the SPU normalized LMS with orthogonal correction factors (SPU-NLMS-OCF) algorithms...
متن کاملExploiting Irrelevance Reasoning to Guide Problem Solving
Identifying that parts of a knowledge base (KB) are irrelevant to a speciic query is a powerful method of controlling search during problem solving. However, nding methods of such irrelevance reasoning and analyzing their utility are open problems. We present a framework based on a proof-theoretic analysis of irrelevance that enables us to address these problems. Within the framework, we focus ...
متن کاملTwo Novel Chaos-Based Algorithms for Image and Video Watermarking
In this paper we introduce two innovative image and video watermarking algorithms. The paper’s main emphasis is on the use of chaotic maps to boost the algorithms’ security and resistance against attacks. By encrypting the watermark information in a one dimensional chaotic map, we make the extraction of watermark for potential attackers very hard. In another approach, we select embedding po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991